Web Service Composition via Supervisory Control Theory
نویسندگان
چکیده
منابع مشابه
Enhancement of Robust Tracking Performance via Switching Supervisory Adaptive Control
When the process is highly uncertain, even linear minimum phase systems must sacrifice desirable feedback control benefits to avoid an excessive ‘cost of feedback’, while preserving the robust stability. In this paper, the problem of supervisory based switching Quantitative Feedback Theory (QFT) control is proposed for the control of highly uncertain plants. According to this strategy, the unce...
متن کاملInfinite Games in Epistemic Temporal Logic via Supervisory Control Theory
We embed the framework of infinite two-player turn-based games played on graphs with safety objectives in an epistemic temporal logic. This embedding is made possible thanks to two intermediate embeddings: the first is from infinite games with safety objectives to supervisory control theory and the second is from supervisory control theory to epistemic temporal logic. Thereby, we are able to de...
متن کاملSemantic Constraint and QoS-Aware Large-Scale Web Service Composition
Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...
متن کاملQoS-Based web service composition based on genetic algorithm
Quality of service (QoS) is an important issue in the design and management of web service composition. QoS in web services consists of various non-functional factors, such as execution cost, execution time, availability, successful execution rate, and security. In recent years, the number of available web services has proliferated, and then offered the same services increasingly. The same web ...
متن کاملPerformance in Supervisory Control Theory
A supervisor is generated with Supervisory Control Theory [3], resulting in a nonblocking and minimally restrictive controller. Time is introduced time using timed automata theory. A compact data structure is used to keep track of the time information in the timed automata: Heaps of Pieces [2]. The fastest sequence of events is found, using graph search algorithms of Dijkstra and A [1]. This is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2874564